Proof Output and Transformation for Disconnection Tableaux
نویسندگان
چکیده
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs. In this paper we present a new method of transforming disconnection tableau proofs found by the prover system DCTP into a series of resolution inferences representing a resolution refutation of the proof problem.
منابع مشابه
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
P. Baumgartner, R. Hähnle & J. Posegga, ed., 4 International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 95), LNAI 918, pp. 106–121, c ©Springer Verlag, 1995 Abstract. We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying hi...
متن کاملTransforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction
A proof tableau of Hoare logic is an annotated program with preand post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence of rewriting induction for constrained rewriting. We also show that the resulting sequence is a valid proof for an inductive theorem correspondi...
متن کاملUnit Propagation in a Tableau Framework
Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We show a way of integrating a variant of unit propagation into the disconnection calculus and present some results obtained with an implementation of unit propagation in the DCTP theorem prover that show the usefulness of o...
متن کاملDual Equivalence Graphs and a Combinatorial Proof of Llt and Macdonald Positivity
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon tableaux which we transform into a dual equivalence graph, we give a combinatorial proof of the symmetry and Schur positivity of the ribbon tableaux generating func...
متن کاملSimilar constructions for young tableaux and involutions, and their application to shiftable tableaux
which has a straightforward combinatorial proof when an is the number of involutions of [n], must also hold when an is the number of Young tableaux on [n]. In this paper, we first give (Section 3) a combinatorial proof of (1) for Young tableaux which agrees under the Robinson-Schensted correspondence with the proof for involutions. The proof involves a recursive construction which depends in pa...
متن کامل